// Loser_Syx is here.
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <ctime>
#include <random>
#include <map>
#include <set>
using namespace std;
const int N = 1e5 + 19;
int cnt[N];
int main() {
	freopen("duel.in", "r", stdin);
	freopen("duel.out", "w", stdout);
	int n; scanf("%d", &n);
	for (int i = 1, x; i <= n; ++i) {
		scanf("%d", &x); ++cnt[x];
	}
	int ans=0,tot=0;
	for (int i=N-1;i;--i) {
		if (tot<cnt[i]) tot=ans=cnt[i];
	} printf("%d\n",ans);
	return 0;
}
// 14:35 Accepted.